Facet browsing currently unavailable
Page 1 of 136 results
Sort by: relevance publication year
Neural Computation of Capacity Region of Memoryless Multiple Access Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Entanglement-assisted multiple-access channels: capacity regions and protocol designs PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by DARPA (N660012014029) | NSF (1941583,ECCS-1920742,CCF-1907918) |
Private Classical Communication over Quantum Multiple-Access Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by NSF (CCF-1850227,CCF-2047913) |
Channel Inclusion Beyond Discrete Memoryless Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Communication With Adversary Identification in Byzantine Multiple Access Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by Department of Atomic Energy, Government of India (RTI4001) | Science & Engineering Research Board, India (MTR/2020/000308) |
Portfolio Growth Rate and Ergodic Capacity of Fading Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
On the Capacity Region of Gaussian Broadcast Channels under Two-Sided Noisy Feedback PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by Department of Atomic Energy, Government of India (RTI4001) |
Feedback Capacity of MIMO Gaussian Channels PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by National Science Foundation (NSF) (CCF-1751356,CCF-1956386) |
Secure Modulo Sum via Multiple Access Channel PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by JSPS Grant-in-Aid for Scientific Research (A) (17H01280,16KT0017) |
Universal classical-quantum multiple access channel coding PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Near-Optimal Coding for Massive Multiple Access PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Capacity Bounds and User Identification Costs in Rayleigh-Fading Many-Access Channel PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
The Rate-Equivocation Region of the Degraded Discrete-Time Poisson Wiretap Channel PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by National Science Foundation (CAREER) (2114779) |
Asynchronous Guessing Subject to Distortion PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Feedback Gains for Gaussian Massive Multiple-Access Channels PROCEEDINGS ARTICLE published 17 October 2021 in 2021 IEEE Information Theory Workshop (ITW) |
Multiple Access Channel Simulation PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by Department of Atomic Energy, Government of India (RTI4001) | Science & Engineering Research Board, India (MTR/2020/000308) |
Optimal Thresholding Quantizer Maximizing Mutual Information of Discrete Multiple-Input Continuous One-Bit Output Quantization PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Communication-Efficient Signature-Free Asynchronous Byzantine Agreement PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by NSF EPSCoR-Louisiana Materials Design Alliance (LAMDA) Program (OIA-1946231) | Louisiana Board of Regents Support Fund (BoRSF) (32-4121-40336) |
Managing Noise and Interference Separately - Multiple Access Channel Decoding using Soft GRAND PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) |
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT) Research funded by NSF (CCF-1817241,CCF-1908725,CCF-1909451) |